A New Switch Block for Segmented FPGAs
نویسندگان
چکیده
FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs," IEEE Transactions on 1 2 4 8 1 6 New Univ. Wilton Subset Fig.7. Delay desults the Subset switch block. However, this is the average over 19 circuits; in 9 of the 19 circuits, the proposed switch block actually resulted in faster circuits. 5 Conclusions In this paper, we h a ve presented a new switch block for FPGAs with segmented routing architectures. This new switch block combines the routability o f t h e Wilton block with the area eeciency of the Disjoint block. Experimental results have shown that the new switch block outperforms all previous switch blocks over a wide range of segmented architectures. For segments of length 4, our switch block results in an FPGA with 13 fewer routing transistors. The speed performance of FPGAs employing the new switch block is roughly the same as that obtained using the previous best switch block. The authors wish to thank Dr. Vaughn Betz for his helpful discussions and for supplying us with the VPR place and route tool. References 1. J. Rose and D. Hill, Architectural and physical design challenges for one-million gate FPGAs and beyond," in
منابع مشابه
A Router for Symmetrical FPGAs based on Exact Routing Density Evaluation
This paper presents a new performance and routability driven routing algorithm for symmetrical array based field-programmable gate arrays (FPGAs). A key contribution of our work is to overcome one essential limitation of the previous routing algorithms: inaccurate estimations of routing density which were too general for symmetrical FPGAs. To this end, we derive an exact routing density calcula...
متن کاملOn Optimum Designs of Universal Switch Blocks
This paper presents a breakthrough decomposition theorem on routing topology and its applications in the designing of universal switch blocks. A switch block of k sides and W terminals on each side is said to be universal (a (k, W )-USB) if it is routable for every set of 2-pin nets with channel density at most W . The optimum USB design problem is to design a (k, W )-USB with the minimum numbe...
متن کاملGeneric Universal Switch Blocks
A switch block M with W terminals on each side is said to be universal if every set of nets satisfying the dimension constraint (i.e., the number of nets on each side of M is at most W ) is simultaneously routable through M [2]. In this paper, we present an algorithm to construct N -sided universal switch blocks with W terminals on each side. Each of our universal switch blocks has N2 W switche...
متن کاملSwitch Bound Allocation for Maximizing Routability in Timing-Driven Routing for FPGAs
In segmented channel routing of row-based FPGAs, the routability and interconnection delays depend on the choice of the upper bounds on the number of programmable switches used in routing net segments in the channel. Traditionally, the upper bounds for the net segments in the same channel are set uniformly. In this paper, we present algorithms for determining the upper bounds for all net segmen...
متن کاملSegmented Routing for Speed-Performance and Routability in Field-Programmable Gate Arrays
This paper addresses several issues involved for routing in Field-Programmable Gate Arrays (FPGAs) that have both horizontal and vertical routing channels, with wire segments of various lengths. Routing is studied by using CAD routing tools to map a set of benchmark circuits into FPGAs, and measuring the effects that various parameters of the CAD tools have on the implementation of the circuits...
متن کامل